%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : PUZ083^1 : TPTP v8.1.2. Released v3.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n002.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 13:14:41 EDT 2023

% Result   : Theorem 3.51s 3.70s
% Output   : Proof 3.51s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : PUZ083^1 : TPTP v8.1.2. Released v3.6.0.
% 0.12/0.14  % Command    : duper %s
% 0.14/0.35  % Computer : n002.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sat Aug 26 23:03:48 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 3.51/3.70  SZS status Theorem for theBenchmark.p
% 3.51/3.70  SZS output start Proof for theBenchmark.p
% 3.51/3.70  Clause #0 (by assumption #[]): Eq (says peter (∀ (X : Prop), says peter X → Not X)) True
% 3.51/3.70  Clause #1 (by assumption #[]): Eq (Not (Not (∀ (X : Prop), says peter X → X))) True
% 3.51/3.70  Clause #2 (by clausification #[1]): Eq (Not (∀ (X : Prop), says peter X → X)) False
% 3.51/3.70  Clause #3 (by clausification #[2]): Eq (∀ (X : Prop), says peter X → X) True
% 3.51/3.70  Clause #4 (by clausification #[3]): ∀ (a : Prop), Eq (says peter a → a) True
% 3.51/3.70  Clause #5 (by clausification #[4]): ∀ (a : Prop), Or (Eq (says peter a) False) (Eq a True)
% 3.51/3.70  Clause #7 (by identity boolHoist #[5]): ∀ (a : Prop), Or (Eq a True) (Or (Eq (says peter False) False) (Eq a True))
% 3.51/3.70  Clause #8 (by bool simp #[0]): Eq (says peter (And (says peter True → Not True) (says peter False → Not False))) True
% 3.51/3.70  Clause #9 (by bool simp #[8]): Eq (says peter (And (says peter True → Not True) (says peter False → True))) True
% 3.51/3.70  Clause #10 (by bool simp #[9]): Eq (says peter (And (says peter True → Not True) True)) True
% 3.51/3.70  Clause #11 (by bool simp #[10]): Eq (says peter (says peter True → Not True)) True
% 3.51/3.70  Clause #12 (by bool simp #[11]): Eq (says peter (says peter True → False)) True
% 3.51/3.70  Clause #13 (by bool simp #[12]): Eq (says peter (Not (says peter True))) True
% 3.51/3.70  Clause #14 (by identity loobHoist #[13]): Or (Eq (says peter True) True) (Eq (Not (says peter True)) False)
% 3.51/3.70  Clause #15 (by identity boolHoist #[13]): Or (Eq (says peter False) True) (Eq (Not (says peter True)) True)
% 3.51/3.70  Clause #16 (by clausification #[14]): Or (Eq (says peter True) True) (Eq (says peter True) True)
% 3.51/3.70  Clause #17 (by eliminate duplicate literals #[16]): Eq (says peter True) True
% 3.51/3.70  Clause #18 (by eliminate duplicate literals #[7]): ∀ (a : Prop), Or (Eq a True) (Eq (says peter False) False)
% 3.51/3.70  Clause #19 (by clausification #[15]): Or (Eq (says peter False) True) (Eq (says peter True) False)
% 3.51/3.70  Clause #20 (by forward demodulation #[19, 17]): Or (Eq (says peter False) True) (Eq True False)
% 3.51/3.70  Clause #21 (by clausification #[20]): Eq (says peter False) True
% 3.51/3.70  Clause #22 (by superposition #[21, 18]): ∀ (a : Prop), Or (Eq a True) (Eq True False)
% 3.51/3.70  Clause #23 (by clausification #[22]): ∀ (a : Prop), Eq a True
% 3.51/3.70  Clause #24 (by falseElim #[23]): False
% 3.51/3.70  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------